On Fractional Realizations of Graph Degree Sequences
نویسنده
چکیده
We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope; we characterize degree sequences for which each polytope vertex corresponds to a simple graph realization. These include the degree sequences of threshold and pseudo-split graphs, and we characterize their realizations both in terms of forbidden subgraphs and graph structure.
منابع مشابه
The Tree of Trees: on methods for finding all non-isomorphic tree-realizations of degree sequences
A degree sequence for a graph is a list of positive integers, one for every vertex, where each integer corresponds to the number of neighbors of that vertex. It is possible to create sequences that have no corresponding graphs, as well as sequences that correspond to multiple distinct (i.e., non-isomorphic) graphs. A graph that corresponds to a given degree sequence is called a realization of t...
متن کاملSome Problems on Graphic Sequences
A nonnegative integer sequence π is graphic if there is some simple graph G having degree sequence π. In that case, G is said to realize or be a realization of π. A given degree sequence may have many realizations, and it has been of interest to examine the spectrum of properties and parameters that occur across these realizations. In this survey, we present five areas of recent research on gra...
متن کاملOn the Swap-Distances of Different Realizations of a Graphical Degree Sequence
One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the degree sequence of a simple graph (or it is graphical for short). One method to solve this problem is the greedy algorithm of Havel and Hakimi, which is based on the swap operation. Another, closely related question i...
متن کاملTaxonomy of Graphs of Order 10
The taxonomy (basic structural characteristics and relationships) of the simple graphs of small order is of fundamental importance in graph theory. This joint work with Peter Adams (Univ. Queensland, Australia) and James MacDougall (Univ. Newcastle, Australia) reports on the taxonomy of the 12,005,168 simple graphs of order 10. Topics discussed include their degree sequences, particularly multi...
متن کاملAlgorithms for realizing degree sequences of directed graphs
The Havel-Hakimi algorithm for constructing realizations of degree sequences for undirected graphs has been used extensively in the literature. A result by Kleitman and Wang extends the Havel-Hakimi algorithm to degree sequences for directed graphs. In this paper we go a step further and describe a modification of Kleitman and Wang’s algorithm that is a more natural extension of Havel-Hakimi’s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014